Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems

A Frequency Assignment Problem (FAP) is the problem that arises when to a given set of transmitters frequencies have to be assigned such that spectrum is used efficiently and the interference between the transmitters is minimal. In this paper we see the frequency assignment problem as a generalised graph colouring problem, where transmitters are presented by vertices and interaction between two transmitters by a weighted edge. We generalise some properties of Laplacian matrices that hold for simple graphs. We investigate the use of Laplacian eigenvalues and eigenvectors as tools in the analysis of properties of a FAP and its generalised chromatic number (the so-called span).